A QUADRATIC B-SPLINE GALERKIN APPROACH FOR SOLVING A COUPLED KDV EQUATION
نویسندگان
چکیده
منابع مشابه
A Galerkin B-spline Approach to One Dimensional Heat Equation
In this paper a numerical solution of one dimensional heat equation is presented using Galerkin B-spline finite element method. Quadratic B-spline basis functions are used for finding the solution. Two test problems are studied to evaluate the efficiency of the given technique. Numerical algorithms are developed for the simulation to hold. Results obtained are compared with the exact solution a...
متن کاملApplication of linear combination between cubic B-spline collocation methods with different basis for solving the KdV equation
In the present article, a numerical method is proposed for the numerical solution of the KdV equation by using a new approach by combining cubic B-spline functions. In this paper we convert the KdV equation to system of two equations. The method is shown to be unconditionally stable using von-Neumann technique. To test accuracy the error norms L2, L∞ are computed. Three invariants of motion are...
متن کاملB-SPLINE COLLOCATION APPROACH FOR SOLUTION OF KLEIN-GORDON EQUATION
We develope a numerical method based on B-spline collocation method to solve linear Klein-Gordon equation. The proposed scheme is unconditionally stable. The results of numerical experiments have been compared with the exact solution to show the efficiency of the method computationally. Easy and economical implementation is the strength of this approach.
متن کاملA NEW APPROACH FOR SOLVING FULLY FUZZY QUADRATIC PROGRAMMING PROBLEMS
Quadratic programming (QP) is an optimization problem wherein one minimizes (or maximizes) a quadratic function of a finite number of decision variable subject to a finite number of linear inequality and/ or equality constraints. In this paper, a quadratic programming problem (FFQP) is considered in which all cost coefficients, constraints coefficients, and right hand side are characterized by ...
متن کاملA New Approach for Solving Interval Quadratic Programming Problem
This paper discusses an Interval Quadratic Programming (IQP) problem, where the constraints coefficients and the right-hand sides are represented by interval data. First, the focus is on a common method for solving Interval Linear Programming problem. Then the idea is extended to the IQP problem. Based on this method each IQP problem is reduced to two classical Quadratic Programming (QP) proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Modelling and Analysis
سال: 2013
ISSN: 1392-6292,1648-3510
DOI: 10.3846/13926292.2013.760011